A nearly optimal algorithm to decompose binary forms
نویسندگان
چکیده
منابع مشابه
Nearly Optimal Algorithms for Canonical Matrix Forms
A Las Vegas type probabilistic algorithm is presented for nding the Frobenius canonical form of an n n matrix T over any eld K. The algorithm requires O~(MM(n)) = MM(n) (logn) O(1) operations in K, where O(MM(n)) operations in K are suucient to multiply two n n matrices over K. This nearly matches the lower bound of (MM(n)) operations in K for this problem, and improves on the O(n 4) operations...
متن کاملA nearly-optimal Fano-based coding algorithm
Statistical coding techniques have been used for a long time in lossless data compression, using methods such as Hu man's algorithm, arithmetic coding, Shannon's method, Fano's method, etc. Most of these methods can be implemented either statically or adaptively. In this paper, we show that although Fano coding is suboptimal, it is possible to generate static Fano-based encoding schemes which a...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کاملAbout Gordan's Algorithm for Binary Forms
In this paper, we present a modern version of Gordan’s algorithm on binary forms. Symbolic method is reinterpreted in terms of SL(2,C)–equivariant homomorphisms defined upon Cayley operator and polarization operator. A graphical approach is thus developed to obtain Gordan’s ideal, a central key to get covariant basis of binary forms. To illustrate the power of this method, we obtain for the fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2021
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2020.06.002